16fe7628d1df8ed8f16fb799fdcd075e602f41ea,src/math/jwave/Transform.java,Transform,forward,#number[][][]#,264

Before Change



    int M = spaceTime.length;

    if( !_mathToolKit.isBinary( M ) )
      throw new JWaveFailure(
          "given space dimension "
              + M
              + " is not 2^p = 1, 2, 4, 8, 16, 32, .. "
              + "please use the Ancient Egyptian Decomposition for any other array length!" );

    for( int i = 0; i < M; i++ ) { // M(i)

      int N = spaceTime[ i ].length;

      if( !_mathToolKit.isBinary( N ) )
        throw new JWaveFailure(
            "given space dimension N(i)="
                + N
                + " is not 2^p = 1, 2, 4, 8, 16, 32, .. "
                + "please use the Ancient Egyptian Decomposition for any other array length!" );

      for( int j = 0; j < N; j++ )
        // // N(j)
        if( !_mathToolKit.isBinary( spaceTime[ i ][ j ].length ) )
          // O
          throw new JWaveFailure(
              "given space dimension M(j)="
                  + spaceTime[ i ][ j ].length
                  + " is not 2^p = 1, 2, 4, 8, 16, 32, .. "
                  + "please use the Ancient Egyptian Decomposition for any other array length!" );

    } // i

    return _transform.forward( spaceTime );

  } // forward

After Change


   */
  public double[ ][ ][ ] forward( double[ ][ ][ ] spaceTime ) {

    double[ ][ ][ ] spaceHilb = null;

    try {

      spaceHilb = _transform.forward( spaceTime );

    } catch( JWaveException e ) {

      e.printStackTrace( );

    } // try

    return spaceHilb;

  } // forward